Perfect hash families from transversal designs
نویسندگان
چکیده
منابع مشابه
The Stein-Lovász Theorem and Its Applications to Some Combinatorial arrays
The Stein-Lovász Theorem can be used to get existence results for some combinatorial problems using constructive methods rather than probabilistic methods. In this paper, we discuss applications of the Stein-Lovász Theorem to some combinatorial set systems and arrays, including perfect hash families, separating hash families, splitting systems, covering designs, lotto designs and ∆-free systems...
متن کاملSuper-simple balanced incomplete block designs with block size 5 and index 3
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in constructing codes and designs such as superimposed codes and perfect hash families. The existence of super-simple (v, 4, λ)BIBDs have been determined for λ = 2, 3, 4, 5, 6. In this paper, we investigate the existence...
متن کاملSuper-simple (v, 5, 4) designs
Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-simple (v, 5, 2)-BIBDs with possible exceptions of v ∈ {75, 95, 115, 135, 195, 215, 231, 285, 365, 385, 515}. In this article, we investigate the existence of a super-simple (v, 5, 4)-BIBD and show that such a design exi...
متن کاملSome Recursive Constructions for Perfect Hash Families
An (n; m; w)-perfect hash family is a set of functions F such that there exists at least one f 2 F such that fj X is one-to-one. Perfect hash families have been extensively studied by computer scientists for over 15 years, mainly from the point of view of constructing eecient algorithms. In this paper, we study perfect hash families from a com-binatorial viewpoint, and describe some new recursi...
متن کاملSuper-simple balanced incomplete block designs with block size 4 and index 5
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in other constructions, such as superimposed codes and perfect hash families etc. The existence of super-simple (v, 4, λ)-BIBDs have been determined for λ = 2, 3, 4 and 6. When λ = 5, the necessary conditions of such a d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 37 شماره
صفحات -
تاریخ انتشار 2007